Generalized activities and K-terminal reliability. II
نویسندگان
چکیده
منابع مشابه
Generalized activities and reliability
The analysis of the Tutte polynomial of a matroid using activities is associated with a shelling of the family of spanning sets. We introduce an activities analysis of the reliability of a system specified by an arbitrary clutter, associated with an S-partition rather than a shelling. These activities are related to a method of constructing Boolean interval partitions developed by Dawson in the...
متن کاملK-Terminal Network Reliability
Let GK denote a graph G whose edges can fail and with a set K C V specified. Edge failures are independent and have known probabilities. The K-terminal reliability of GK, R(GK), is the probability that all vertices in K are connected by working edges. A factoring algorithm for computing network reliability recursively applies the formula R(GK) = piR(GK * eC) + qiR(GK e) where GK * ec is GK, wit...
متن کاملSplitting the K-Terminal Reliability
Let G = (V,E) be a graph and K ⊆ V a set of terminal vertices. Assume now that the edges of G are failing independently with given probabilities. The Kterminal reliability R(G,K) is the probability that all vertices in K are mutually connected. In this article we propose an efficient splitting formula for R(G,K) at a separating vertex set of G by lattice theoretic methods.
متن کاملMulti-state Two-Terminal Reliability: A Generalized Cut-Set Approach
This paper describes an extension of a classical network reliability problem to the multi-state case. The two-terminal reliability (2TR) problem assumes a network and its elements can be in either a working or a failed state. However, many practical networks are built of elements that may operate in more than two states. The major focus of this study is to develop a methodology for obtaining th...
متن کاملAlgorithms for K-terminal reliability problems with node failures
Consider a distributed processing system with a set K of sites that can either cooperate in computing a function or hold resources required by other sites. The system is implemented using a communication network with unreliable nodes. Two simplified reliability problems then arise. In the first problem, we are interested in computing the probability that every operational pair of sites in K can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0094-k